Minimal Polynomial Algorithms for Finite Sequences
نویسندگان
چکیده
منابع مشابه
Minimal Zero Sequences of Finite Cyclic Groups
If G is a finite Abelian group, let MZS(G, k) denote the set of minimal zero sequences of G of length k. In this paper we investigate the structure of the elements of this set, and the cardinality of the set itself. We do this for the class of groups G = Zn for k both small (k ≤ 4) and large (k > 2n 3 ).
متن کاملA Unified Approach for Design of Lp Polynomial Algorithms
By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...
متن کاملMeasures of Pseudorandomness for Finite Sequences: Minimal Values
Mauduit and Sárközy introduced and studied certain numerical parameters associated to finite binary sequences EN ∈ {−1, 1} in order to measure their ‘level of randomness’. Two of these parameters are the normality measure N (EN ) and the correlation measure Ck(EN ) of order k, which focus on different combinatorial aspects of EN . In their work, amongst others, Mauduit and Sárközy investigated ...
متن کاملThe arithmetic of consecutive polynomial sequences over finite fields
Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen consecutively from a sequence in a finite field of odd prime characteristic. We study the arithmetic of such sequences, including bounds for the largest degree of ir...
متن کاملSolving Polynomial Systems over Finite Fields: Algorithms, Implementation and Applications
Polynomial systems can be used to formulate a large variety of non-linear problems. Polynomial systems over finite fields are of particular interest because of their applications in Cryptography, Coding Theory, and other areas of information science and technologies. Solving polynomial systems is a central topic in Computer Algebra and has stimulated the development in this area. In this thesis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2010
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2010.2054150